package com.atguigu.array_b;
//数组算法之冒泡排序
public class ArrayDemo2 {
    public static void main(String[] args) {

        int[] arr = {45,68,77,99,32,145,326,785,641,11};

        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-1-i; j++) {
                if (arr[j] > arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
                }
            }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+ " ");
        }
        }
    }

